The Divide-and-Conquer Subgoal-Ordering Algorithm for Speeding up Logic Inference
نویسندگان
چکیده
منابع مشابه
The Divide-and-Conquer Subgoal-Ordering Algorithm for Speeding up Logic Inference
It is common to view programs as a combination of logic and control: the logic part de nes what the program must do, the control part { how to do it. The Logic Programming paradigm was developed with the intention of separating the logic from the control. Recently, extensive research has been conducted on automatic generation of control for logic programs. Only a few of these works considered t...
متن کاملThe Divide - and - Conquer Subgoal - Ordering Algorithmfor Speeding up Logic
It is common to view programs as a combination of logic and control: the logic part deenes what the program must do, the control part { how to do it. The Logic Programming paradigm was developed with the intention of separating the logic from the control. Recently, extensive research has been conducted on automatic generation of control for logic programs. Only a few of these works considered t...
متن کاملSpeeding Up Inference for Probabilistic Logic Programs
Probabilistic Logic Programming (PLP) allows to represent domains containing many entities connected by uncertain relations and has many applications in particular in Machine Learning. PITA is a PLP algorithm for computing the probability of queries that exploits tabling, answer subsumption and Binary Decision Diagrams (BDDs). PITA does not impose any restriction on the programs. Other algorith...
متن کاملA Divide-and-Conquer Discretization Algorithm
The problem of real value attribute discretization can be converted into the reduct problem in the Rough Set Theory, which is NP-hard and can be solved by some heuristic algorithms. In this paper we show that the straightforward conversion is not scalable and propose a divide-and-conquer algorithm. This algorithm is fully scalable and can reduce the time complexity dramatically especially while...
متن کاملIDS: A Divide-and-Conquer Algorithm for Inference in Polytree-Shaped Credal Networks
A credal network is a graph-theoretic model that represents imprecision in joint probability distributions. An inference in a credal net aims at computing an interval for the probability of an interest event. The algorithms for inference in credal networks can be divided into exact and approximate. The selection of such an algorithm is based on a trade off that ponders how much time someone wan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 1998
ISSN: 1076-9757
DOI: 10.1613/jair.509